A Study on Continuous Linear Knapsack Problems with Fuzzy Random Variable Coefficients
نویسندگان
چکیده
منابع مشابه
Knapsack Problems with Random Budgets
Given a set of elements, each having a profit and cost associated with it, and a budget, the 0-1 knapsack problem finds a subset of the elements with maximum possible combined profit subject to the combined cost not exceeding the budget. In this paper we study a stochastic version of the problem in which the budget is random. We propose two different formulations of this problem, based on diffe...
متن کاملOptimistic Stackelberg solutions to bilevel linear programming with fuzzy random variable coefficients
In this paper, we consider a kind of bilevel linear programming problem where the coefficients of both objective functions are fuzzy random variables. The purpose of this paper is to develop a computational method for obtaining optimistic Stackelberg solutions to such a problem. Based on a level sets of fuzzy random variables, we first transform the fuzzy random bilevel programming problem into...
متن کاملBoundary Value Problems for Linear PDEs with Variable Coefficients
A new method is introduced for studying boundary value problems for a class of linear PDEs with variable coefficients. This method is based on ideas recently introduced by the author for the study of boundary value problems for PDEs with constant coefficients. As illustrative examples the following boundary value problems are solved: (a) A Dirichlet and a Neumann problem on the half line for th...
متن کاملA Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. C...
متن کاملContinuous Knapsack Problems
TIle multiple-choice continuous knapsack problem is dermed as follows: maximize z = ~n ~~i CjJ'XiJ' 1=1 J= 1 subject to (1) ~n ~mi aijXij .;;; b, (2) 0 .;;; Xij .;;; I, i = 1,2, ... , n,j = 1. 2, ... , mi, (3) at most one of Xij G = 1,2, ... , mi) 1=1 J=1 is positive for each i = I, 2, ... , n, where n, mi are positive integers and aij are nonnegative integers. In this paper, it is proved that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Intelligent Informatics
سال: 2004
ISSN: 1347-7986,1881-7203
DOI: 10.3156/jsoft.16.153